Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
231	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the parameterized complexity of a generalized Rush Hour puzzle ∗ H. Fernau† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:31 Puzzles Rush Hour Parameterized complexity PSPACE-complete Polynomial P Games Complexity classes Mechanical puzzles
232	KYEEWA FEBRUARY, 2000 WALKING DATES Add to Reading List Source URL: www.vallabeachmarkets.org.au Language: English - Date: 2015-04-30 02:07:26 Complexity classes NP
233	Making Σ-Protocols Non-Interactive without Random Oracles Pyrros Chaidos, Jens Groth University College London Add to Reading List Source URL: www.iacr.org Language: English - Date: 2015-03-27 08:17:32 Applied mathematics Mathematics Complexity classes Metalogic Zero-knowledge proof Soundness IP NP Completeness Theoretical computer science Cryptographic protocols Proof theory
234	FA10_apps_adm_acc_new_final.xlsx Add to Reading List Source URL: grad.ucsd.edu Language: English - Date: 2014-10-31 13:42:31 Complexity classes NP Healthcare science Biological engineering Biomedical scientist Medicine Health Science
235	PCCR 2014 Report Serge Gaspers, UNSW Australia and NICTA PCCR 2014, the 2nd Workshop on the Parameterized Complexity of Computational Reasoning, took place in Vienna, Austria, 17-18 July 2014, as part of FLoC and the Vie Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2014-09-25 08:44:45 Computational complexity theory Parameterized complexity FO Connectivity SL NP-complete problems Theoretical computer science Applied mathematics Complexity classes
236	Welcome Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. We are delighted to announce the IPEC 2010 winners of the Excellent Student Paper Awards. The meeting was expertly organized in Chennai Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:22:16 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Complexity classes Tree decomposition Dominating set International Colloquium on Automata Languages and Programming Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
237	Algorithms: Complexity Classes and Lower Bounds Martin Held FB Computerwissenschaften Universität Salzburg A-5020 Salzburg, Austria Add to Reading List Source URL: www.cosy.sbg.ac.at Language: English - Date: 2014-10-17 01:42:07 Complexity classes P versus NP problem NP P Low EXPTIME NC Parameterized complexity Karp–Lipton theorem Theoretical computer science Computational complexity theory Applied mathematics
238	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
239	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics S¨oren Laue∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:48 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
240	Succinct Randomized Encodings and their Applications∗ Nir Bitansky† Sanjam Garg‡ Huijia Lin§ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-21 11:01:51 Complexity classes EXPTIME P/poly Time complexity PP NL P NC Theoretical computer science Computational complexity theory Applied mathematics

UPDATE